Java 9 Data Structures and Algorithms by Debasish Ray Chawdhuri

Author:Debasish Ray Chawdhuri
Language: eng
Format: epub, azw3, pdf
Publisher: Packt Publishing

We have created an enum DepthFirstTraversalType to pass to the traverseDepthFirst method. We process the current node according to its value. Note that the only thing that changes is when the processor is called to process a node. Let's create a binary tree and see how the results differ in the case of each ordering:

public static void main(String [] args){ BinaryTree<Integer> tree = new BinaryTree<>(); tree.addRoot(1); Node<Integer> n1 = tree.getRoot(); Node<Integer> n2 = tree.addChild(n1, 2, true); Node<Integer> n3 = tree.addChild(n1, 3, false); Node<Integer> n4 = tree.addChild(n2, 4, true); Node<Integer> n5 = tree.addChild(n2, 5, false); Node<Integer> n6 = tree.addChild(n3, 6, true); Node<Integer> n7 = tree.addChild(n3, 7, false); Node<Integer> n8 = tree.addChild(n4, 8, true); Node<Integer> n9 = tree.addChild(n4, 9, false); Node<Integer> n10 = tree.addChild(n5, 10, true); tree.traverseDepthFirst(System.out::print, tree.getRoot(), DepthFirstTraversalType.PREORDER); System.out.println(); tree.traverseDepthFirst(System.out::print, tree.getRoot(), DepthFirstTraversalType.INORDER); System.out.println(); tree.traverseDepthFirst(System.out::print, tree.getRoot(), DepthFirstTraversalType.POSTORDER); System.out.println(); }

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.